Beamforming Initialization and Data Prewhitening in Natural Gradient Convolutive Blind Source Separation of Speech Mixtures
نویسندگان
چکیده
Successful speech enhancement by convolutive blind source separation (BSS) techniques requires careful design of all aspects of the chosen separation method. The conventional strategy for system initialization in both timeand frequency-domain BSS involves a diagonal center-spike FIR filter matrix and no data preprocessing; however, this strategy may not be the best for any chosen separation algorithm. In this paper, we experimentally evaluate two different approaches for potentially-improving the performance of time-domain and frequencydomain natural gradient speech separation algorithms – prewhitening of the signal mixtures, and delay-and-sum beamforming initialization for the separation system – to determine which of the two classes of algorithms benefit most from them. Our results indicate that frequencydomain-based natural gradient BSS methods generally need geometric information about the system to obtain any reasonable separation quality. For time-domain natural gradient separation algorithms, either beamforming initialization or prewhitening improves separation performance, particularly for larger-scale problems involving three or more sources and sensors.
منابع مشابه
Spatio-Temporal FastICA Algorithms for the Blind Separation of Convolutive Mixtures
This paper derives two spatio–temporal extensions of the well-known FastICA algorithm of Hyvärinen and Oja that are applicable to the convolutive blind source separation task. Our time–domain algorithms combine multichannel spatio–temporal prewhitening via multistage least-squares linear prediction with novel adaptive procedures that impose paraunitary constraints on the multichannel separation...
متن کاملTime domain blind source separation of non-stationary convolved signals by utilizing geometric beamforming
We propose a time-domain BSS algorithm that utilizes geometric information such as sensor positions and assumed locations of sources. The algorithm tackles the problem of convolved mixtures by explicitly exploiting the non-stationarity of the acoustic sources. The learning rule is based on secondorder statistics and is derived by natural gradient minimization. The proposed initialization of the...
متن کاملBlind Source Separation of Convolutive Mixtures of Speech in Frequency Domain
This paper overviews a total solution for frequencydomain blind source separation (BSS) of convolutive mixtures of audio signals, especially speech. Frequency-domain BSS performs independent component analysis (ICA) in each frequency bin, and this is more efficient than time-domain BSS. We describe a sophisticated total solution for frequency-domain BSS, including permutation, scaling, circular...
متن کاملA Natural Gradient Convolutive Blind Source Separation Algorithm for Speech Mixtures
In this paper, a novel algorithm for separating mixtures of multiple speech signals measured by multiple microphones in a room environment is proposed. The algorithm is a modification of an existing approach for density-based multichannel blind deconvolution using natural gradient adaptation. It employs linear predictors within the coefficient updates and produces separated speech signals whose...
متن کاملBlind separation of convolutive mixtures of cyclostationary sources using an extended natural gradient method
An on-line adaptive blind source separation algorithm for the separation of convolutive mixtures of cyclostationary source signals is proposed. The algorithm is derived by a p plying natural gradient iterative learning to the novel cost function which is delined according to the wide sense cyclostationarity of signals. The efficiency of the algorithm is supported by simulations, which show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007